Constructing a Class of Symmetric Graphs
نویسندگان
چکیده
منابع مشابه
Constructing a Class of Symmetric Graphs
We find a natural construction of a large class of symmetric graphs from pointand block-transitive 1-designs. The graphs in this class can be characterized as G-symmetric graphs whose vertex sets admit a G-invariant partition B of block size at least 3 such that, for any two blocks B,C of B, either there is no edge between B and C , or there exists only one vertex in B not adjacent to any verte...
متن کاملA NOTE ON THE COMMUTING GRAPHS OF A CONJUGACY CLASS IN SYMMETRIC GROUPS
The commuting graph of a group is a graph with vertexes set of a subset of a group and two element are adjacent if they commute. The aim of this paper is to obtain the automorphism group of the commuting graph of a conjugacy class in the symmetric groups. The clique number, coloring number, independent number, and diameter of these graphs are also computed.
متن کاملConstructing a large class of supertough graphs
For each odd r ≥ 3 and each n of the form 2kb(r + 2 − 2b) for k ≥ 1 and 1 ≤ b ≤ (r − 1)/2, the first author has constructed an r-regular r/2-tough graph on n vertices. In this paper, we provide an alternate and more advantageous construction. First, both our new construction and its proof are simpler. Second, we use an extension of the notion of graph inflations, as used in a construction given...
متن کاملOn a class of finite symmetric graphs
Let Γ be a G-symmetric graph, and let B be a nontrivial G-invariant partition of the vertex set of Γ . This paper aims to characterize (Γ ,G) under the conditions that the quotient graph ΓB is (G, 2)-arc transitive and the induced subgraph between two adjacent blocks is 2 · K2 or K2,2. The results answer two questions about the relationship between Γ and ΓB for this class of graphs. c © 2007 El...
متن کاملConstructing vertex decomposable graphs
Recently, some techniques such as adding whiskers and attaching graphs to vertices of a given graph, have been proposed for constructing a new vertex decomposable graph. In this paper, we present a new method for constructing vertex decomposable graphs. Then we use this construction to generalize the result due to Cook and Nagel.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2002
ISSN: 0195-6698
DOI: 10.1006/eujc.2002.0600